منابع مشابه
Initial Algebra Semantics Is Enough!
Initial algebra semantics is a cornerstone of the theory of modern functional programming languages. For each inductive data type, it provides a fold combinator encapsulating structured recursion over data of that type, a Church encoding, a build combinator which constructs data of that type, and a fold/build rule which optimises modular programs by eliminating intermediate data of that type. I...
متن کاملInitial Algebra and Final Coalgebra Semantics
The aim of this paper is to relate initial algebra semantics and final coalgebra semantics. It is shown how these two approaches to the semantics of programming languages are each others dual, and some conditions are given under which they coincide. More precisely, it is shown how to derive initial semantics from final semantics, using the initiality and finality to ensure their equality. Moreo...
متن کاملInitial Algebra Semantics for Cyclic Sharing Structures
syntax Set ADJ 1975 S-sorted abstract syntax Set Robinson 1994 Abstract syntax with binding SetF Fiore,Plotkin,Turi 1999 Recursive path ordring LO R. Hasegawa 2002 S-sorted 2nd-order abs. syn. (SetF↓S)S Fiore 2003 2nd-order rewriting systems PreF Hamana 2005 Explicit substitutions [Set,Set]f Ghani,Uustalu,Hamana 2006 Cyclic sharing structures (SetT ∗ )T Hamana 2009
متن کاملInitial Algebra and Final Coalgebra Semantics for Concurrency
The aim of this paper is to relate initial algebra semantics and nal coalgebra semantics It is shown how these two approaches to the semantics of programming languages are each others dual and some conditions are given under which they coincide More precisely it is shown how to derive initial semantics from nal semantics using the initiality and nality to ensure their equality Moreover many fac...
متن کاملInitial Algebra Semantics for Cyclic Sharing Tree Structures
Terms are a concise representation of tree structures. Since they can be naturally defined by an inductive type, they offer data structures in functional programming and mechanised reasoning with useful principles such as structural induction and structural recursion. However, for graphs or ”tree-like” structures – trees involving cycles and sharing – it remains unclear what kind of inductive s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic and Algebraic Programming
سال: 2007
ISSN: 1567-8326
DOI: 10.1016/j.jlap.2007.03.001